A Groebner basis approach to solve a Conjecture of Nowicki

نویسنده

  • Joseph Khoury
چکیده

Let k be a field of characteristic zero, n any positive integer and let δn be the derivation ∑n i=1Xi ∂ ∂Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables over k. A Conjecture of Nowicki (Conjecture 6.9.10 in (8)) states the following ker δn = k[X1, . . . , Xn, XiYj −XjYi; 1 ≤ i < j ≤ n] in which case we say that δn is standard. In this paper, we use the elimination theory of Groebner bases to prove that Nowicki’s conjecture holds in the more general case of the derivation D = ∑n i=1X ti i ∂ ∂Yi , ti ∈ Z≥0. In (6), H. Kojima and M. Miyanishi argued that D is standard in the case where ti = t (i = 1, . . . n) for some t ≥ 3. Although the result is true, we show in Section 4 of this paper that the proof presented in (6) is not complete.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Growth in Varieties of Multioperator Algebras and Groebner Bases in Operads

We consider varieties of linear multioperator algebras, that is, classes of algebras with several multilinear operations satisfying certain identities. To each such a variety one can assign a numerical sequence called a sequence of codimensions. The n-th codimension is equal to the dimension of the vector space of all n-linear operations in the free algebra of the variety. In recent decades, a ...

متن کامل

Computing Groebner Bases in the Boolean Setting with Applications to Counting

We take advantage of the special structure of computations in Z2 to develop algorithms for the computation of Groebner bases and of the Hilbert function in the Boolean setting. Natural sources of applications for our algorithms are the counting problems. We focus, as a case study, on the computation of the permanent. To this regard, one good feature of the Groebner approach is that, unlike othe...

متن کامل

Groebner Basis Under Composition I

The main question of this paper is: When does Groebner basis computation (Buchberger, 1965, 1985) commute with composition? More precisely, let F be a finite set of polynomials in the variables x1, . . . , xn, and let G be a Groebner basis of the ideal generated by F under some term ordering. Let Θ = (θ1, . . . , θn) be a list of n polynomials in the variables x1, . . . , xn. Let F ∗ be the set...

متن کامل

A probabilistic and deterministic modular algorithm for computing Groebner basis over $\Q$

Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over Q, but it does not seem to be popular among CAS implementers. In this paper, I will show how to check a candidate Groebner basis (obtained by reconstruction of several Groebner basis modulo distinct prime ...

متن کامل

Implicitization of Rational Parametric Surfaces

A generalized projective implicitization theorem is presented that can be used to solve the implicitization of rational parametric curves and surfaces in an affine space. The Groebner bases technique is used to implement the algorithm. The algorithm has the advantages that it can handle base points in a parametrization, and no extra factors will be introduced into an implicit equation. The comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2008